منابع مشابه
Complexity of Judgment Aggregation
We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whet...
متن کاملComplexity of judgment aggregation: safety of the agenda
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the set of propositions on which agents are asked to express an opinion. We introduce the problem of checking the safety of the agenda: for a given agenda, can we guarantee that judgment aggregation will never produce an i...
متن کاملParameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
We investigate the parameterized complexity of computing an outcome of the Kemeny rule in judgment aggregation, providing the first parameterized complexity results for this problem for any judgment aggregation procedure. As parameters, we consider (i) the number of issues, (ii) the maximum size of formulas used to represent issues, (iii) the size of the integrity constraint used to restrict th...
متن کاملSome Complexity Results for Distance-Based Judgment Aggregation
Judgment aggregation is a social choice method for aggregating information on logically related issues. In distance-based judgment aggregation, the collective opinion is sought as a compromise that satisfies several structural properties. It would seem that the standard conditions on distance and aggregation functions are strong enough to guarantee existence of feasible procedures. In this pape...
متن کاملParameterized Complexity Results for Agenda Safety in Judgment Aggregation
Many problems arising in computational social choice are of high computational complexity, and some are located at higher levels of the Polynomial Hierarchy. We argue that a parameterized complexity analysis provides valuable insight into the factors contributing to the complexity of these problems, and can lead to practically useful algorithms. As a case study, we consider the problem of agend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2012
ISSN: 1076-9757
DOI: 10.1613/jair.3708